1037B - Reach Median - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define cy cout<<"YES"<<endl;
#define cn cout<<"NO"<<endl;
#define c0 cout<<0<<endl;
#define c1 cout<<1<<endl;
#define f(i,a,n) for(int i=a;i<n;i++)
#define pb push_back
#define svec(v) sort(v.begin(),v.end())
#define svrev(v) sort(v.begin(),v.end(),greater<int>())
 
 
int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t=1;
	// cin>>t;
	while(t--){
		int n,k;
		cin>>n>>k;
		vector<int> v;
		f(i,0,n){
			int x;
			cin>>x;
			v.pb(x);
		}
		svec(v);
		int ans = v[n/2];
		if(ans==k){
			c0;
		}
		else if(ans<k){
			auto it = lower_bound(v.begin(),v.end(),k);
			int ans1 = it - v.begin(),c=0;
			f(i,n/2,ans1){
				c+=abs(v[i]-k);
			}
			cout<<c<<endl;
		}
		else{
			auto it = lower_bound(v.begin(),v.end(),k);
			int ans1 = it - v.begin(),c=0;
			f(i,ans1,n/2 + 1){
				c+=abs(v[i]-k);
			}
			cout<<c<<endl;			
		}
	}
	return 0;
}